108 research outputs found

    Analysis of the MPEG-2 Encoding Algorithm with ROSA1 1This work has been supported by the CICYT project “Performance Evaluation of Distributed Systems”, TIC2000-0701-C02-02.

    Get PDF
    AbstractThe authors present both the specification and a performance analysis of the MPEG2 algorithm for video encoding, by using the Stochastic Process Algebra ROSA. This process algebra is a very general framework for describing and analyzing more complex Real Time Systems than the one presented. Some interesting results about the temporal behaviour of the algorithm and an immediate estimation of benefits when having a twin-processors platform have been obtained

    A sound and complete proof system for probabilistic processes

    Get PDF
    n this paper we present a process algebra model of probabilistic communicating processes based on classical CSP. To define our model we have replaced internal non-determinism by generative probabilistic choices, and external non-determinism by reactive probabilistic choices, with the purpose of maintaining the meaning of the classical CSP operators, once generalized in a probabilistic way. Thus we try to keep valid, as far as possible, the laws of CSP. This combination of both internal and external choice makes strongly difficult the definition of a probabilistic version of CSP. In fact, we can find in the current literature quite a number of papers on probabilistic processes, but only in a few of them internal and external choices are combined, trying to preserve their original meaning. Starting with a denotational semantics where the corresponding domain is a set of probabilistic trees with two kinds of nodes, representing the internal and external choices, we define a sound and complete proof system, with very similar laws to those of the corresponding CSP

    Looking for a cheaper rosa

    Get PDF
    Process Algebras, PAs, are formalisms able to capture the behaviour of a computing system by, for example, giving the labelled transition system, LTS, where states are nodes and where all possible evolutions of the system are arcs; The drawing of the complete LTS is a NP-complete task, so that, the reaching of a particular ?desired? state is a problem which deserves some heuristic for improving the amount of resources to be carried out. In this line, Artificial Intelligence by means of Genetic Algorithms (GA?s), provides metaheuristic techniques that have obtained good results in problems in which exhaustive techniques fail due to the size of the search space, as it is the exploration of a LTS. In this paper, we try to avoid this problem, so only unfolding the most promising (for the task of reaching a ?goal? state) branches within the LTS. Keywords Process Algebra ? Genetic Algorithm ? Complexit

    A polynomial quantum computing algorithm for solving the dualization problem

    Full text link
    Given two prime monotone boolean functions f:{0,1}n{0,1}f:\{0,1\}^n \to \{0,1\} and g:{0,1}n{0,1}g:\{0,1\}^n \to \{0,1\} the dualization problem consists in determining if gg is the dual of ff, that is if f(x1,,xn)=g(x1,xn)f(x_1, \dots, x_n)= \overline{g}(\overline{x_1}, \dots \overline{x_n}) for all (x1,xn){0,1}n(x_1, \dots x_n) \in \{0,1\}^n. Associated to the dualization problem there is the corresponding decision problem: given two monotone prime boolean functions ff and gg is gg the dual of ff? In this paper we present a quantum computing algorithm that solves the decision version of the dualization problem in polynomial time

    Estudio prospectivo de materiales balísticos existentes en el mercado para la construcción de una casa de tiro que permita el realizar ejercicios de tiro con calibres de 5,56 mm y 9 mm.

    Get PDF
    El combate actual ha dejado de desarrollarse en espacios abiertos en los que miles de soldados se enfrentan con ejércitos similares. Hoy en día nuestras tropas desarrollan sus misiones en escenarios englobados dentro de la guerra asimétrica, en la cual uno de los bandos es inferior al otro. Por ello, esta clase de grupos minoritarios llevan el combate a zonas urbanizadas, donde los espacios son reducidos y pueden hacer uso de la población civil.El Ejército de Tierra precisa de instalaciones para instruir a sus tropas en este combate urbanizado. Las denominadas ‘casas de tiro’ permiten preparase para estas situaciones. En el trabajo desarrollado se estudian los diferentes materiales adquiribles en el mercado para conformar esta clase de infraestructuras, con el fin de ayudar en la homologación de la primera casa de tiro en nuestro país. The current combat has ceased to take place in open spaces in which thousands of soliders face each other with similar armies. Today, our troops carry out their missions in asymmetric warfare scenarios, in which one side is inferior to the other. For this reason, this class of minority groups carry out combat in urbanized areas, where spaces are reduced and they can make use of the civilian population.The Army needs facilities for instructing their troops in this urbanized combat. The so-called ‘killing houses’ allow you to prepare for these situations. In the work developed, the different materials available on the market are studied in order to create this kind of infrastructure, in order to help in the homologation of the first killing house in our country.<br /

    Numerical Algorithms for the Analysis of Initial Configuration in a Railway Catenary Structure and Its Code Implementation: A Software Tool CALPE

    Get PDF
    To obtain the best operating conditions in a railway infrastructure, as the pantograph/catenary system, is a priority issue in modern railways, for a correct management and the best performance of this infrastructure. Although most of the published works on this subject are oriented to solving dynamic problems, in order to successfully address these problems a previous static study is necessary. In this paper, we present a methodology for the study of the forces in a railway catenary, according to the equations of statics equilibrium. The results of this work have allowed us to develop two iterative algorithms that calculate a simple and computationally effective lengths of the droppers, which is crucial to determine the initial structural configuration of the catenary parameter. The obtained results have led us to the implementation of a tool to obtain very precise assemblies with significant savings in maintenance, therefore still being used by ADIF, the Spanish railway administration of railways infrastructures

    An Intelligent Transportation System to control air pollution and road traffic in cities ntegrating CEP and Colored Petri Nets

    Get PDF
    Air pollution generated by road traffic in large cities is a great concern in today’s society since pollution has an important impact on human health, even causing premature deaths. To address the problem, this paper presents an Intelligent Transportation System model based on Complex Event Processing technology and Colored Petri Nets (CPNs). It takes into consideration the levels of environmental pollution and road traffic, according to the air quality levels accepted by the international recommendations as well as the handbook emission factors for road transport methodology. This proposal, therefore, tackles a common problem in today’s large cities, where traffic restrictions must be applied due to environmental pollution. CPNs are used in this work as a tool to make decisions about traffic regulations, so as to reduce pollution levels
    corecore